A Posteriori Quantized Matching Pursuit
نویسندگان
چکیده
This paper studies quantization error in the context of Matching Pursuit coded streams and proposes a new coefficient quantization scheme taking benefit of the Matching Pursuit properties. The coefficients energy in Matching Pursuit indeed decreases with the iteration number, and the decay rate can be upper-bounded with an exponential curve driven by the redundancy of the dictionary. The redundancy factor is therefore used to design an optimal a posteriori quantization scheme for multi-resolution Matching Pursuit coding. Bits are optimally distributed between successive coefficients according to their relative contribution to the signal representation. The quantization range and the number of quantization steps are therefore reduced along the iteration number. Moreover, the quantization scheme selects the optimal number of Matching Pursuit iterations to be coded to satisfy rate constraints. Finally, the new exponentially upper-bounded quantization of Matching Pursuit coefficients clearly outperforms classical uniform quantization methods for both random dictionaries and Gabor dictionaries in the practical case of image coding.
منابع مشابه
Redundancy-Driven A Posteriori Matching Pursuit Quantization
This paper studies quantization error in the context of Matching Pursuit coded streams. The quantization noise is shown to depend on error on both coefficients and indexes. It is moreover influenced by the redundancy of the Matching Pursuit dictionary. A novel general formulation of the structural redundancy in overcomplete decompositions is shown to enhance the accuracy of classical redundancy...
متن کاملDependent coding in quantized matching pursuit
Matching pursuit, introduced by Mallat and Zhang, is an algorithm for decomposing a signal into a linear combination of functions chosen from possibly redundant dictionary of functions. (A similar greedy algorithm is well known for nding sparse approximate solutions to underdetermined linear systems of equations.) A variant which we call quantized matching pursuit (QMP) has been proposed for va...
متن کاملOn the statistics of matching pursuit angles
Matching Pursuit decompositions have been employed for signal coding. For this purpose, Matching Pursuit coefficients need to be quantized. However, their behavior has been shown to be chaotic in some cases; posing difficulties to their modeling and quantizer design. In this work, a different approach is presented. Instead of trying to model the statistics of Matching Pursuit coefficients, the ...
متن کاملQuantized Overcomplete Expansions in IRN: Analysis, Synthesis, and Algorithms
Coefficient quantization has peculiar qualitative effects on representations of vectors in IR with respect to overcomplete sets of vectors. These effects are investigated in two settings: frame expansions (representations obtained by forming inner products with each element of the set) and matching pursuit expansions (approximations obtained by greedily forming linear combinations). In both cas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001